Pair Approximations of Takeover Dynamics in Regular Population Structures

نویسندگان

  • Joshua L. Payne
  • Margaret J. Eppstein
چکیده

In complex adaptive systems, the topological properties of the interaction network are strong governing influences on the rate of flow of information throughout the system. For example, in epidemiological models, the structure of the underlying contact network has a pronounced impact on the rate of spread of infectious disease throughout a population. Similarly, in evolutionary systems, the topology of potential mating interactions (i.e., population structure) affects the rate of flow of genetic information and therefore affects selective pressure. One commonly employed method for quantifying selective pressure in evolutionary algorithms is through the analysis of the dynamics with which a single favorable mutation spreads throughout the population (a.k.a. takeover time analysis). While models of takeover dynamics have been previously derived for several specific regular population structures, these models lack generality. In contrast, so-called pair approximations have been touted as a general technique for rapidly approximating the flow of information in spatially structured populations with a constant (or nearly constant) degree of nodal connectivities, such as in epidemiological and ecological studies. In this work, we reformulate takeover time analysis in terms of the well-known Susceptible-Infectious-Susceptible model of disease spread and adapt the pair approximation for takeover dynamics. Our results show that the pair approximation, as originally formulated, is insufficient for approximating pre-equilibrium dynamics, since it does not properly account for the interaction between the size and shape of the local neighborhood and the population size. After parameterizing the pair approximation to account for these influences, we demonstrate that the resulting pair approximation can serve as a general and rapid approximator for takeover dynamics on a variety of spatially-explicit regular interaction topologies with varying population sizes and varying uptake and reversion probabilities. Strengths, limitations, and potential applications of the pair approximation to evolutionary computation are discussed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximating evolutionary dynamics on networks using a Neighbourhood Configuration model.

Evolutionary dynamics have been traditionally studied on homogeneously mixed and infinitely large populations. However, real populations are finite and characterised by complex interactions among individuals. Recent studies have shown that the outcome of the evolutionary process might be significantly affected by the population structure. Although an analytic investigation of the process is pos...

متن کامل

Evolutionary Games of Multiplayer Cooperation on Graphs

There has been much interest in studying evolutionary games in structured populations, often modeled as graphs. However, most analytical results so far have only been obtained for two-player or linear games, while the study of more complex multiplayer games has been usually tackled by computer simulations. Here we investigate evolutionary multiplayer games on graphs updated with a Moran death-B...

متن کامل

D-Spectrum and D-Energy of Complements of Iterated Line Graphs of Regular Graphs

The D-eigenvalues {µ1,…,µp} of a graph G are the eigenvalues of its distance matrix D and form its D-spectrum. The D-energy, ED(G) of G is given by ED (G) =∑i=1p |µi|. Two non cospectral graphs with respect to D are said to be D-equi energetic if they have the same D-energy. In this paper we show that if G is an r-regular graph on p vertices with 2r ≤ p - 1, then the complements of iterated lin...

متن کامل

Pair approximations for spatial structures?

This work explores the success of pair approximations in capturing local correlations and the spatial structure of population contact networks, especially in respect of the rate of spread of epidemics. Networks of interest range from the local extreme where interactions are only between nearest neighbours in some low dimensional space, and the infinite-dimensional ’mean-field’ extreme where all...

متن کامل

On Takeover Times in Spatially Structured Populations: Array and Ring

The takeover time is the expected number of iterations of some selection method until a population consists entirely of copies of the best individual under the assumption that only one best individual is contained in the initial population. This quantity may be used to assess and compare the ‘selection pressures’ of selection methods used in evolutionary algorithms. Here, the notion is generali...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Evolutionary computation

دوره 17 2  شماره 

صفحات  -

تاریخ انتشار 2009